From Constraints to TAGs: A Transformation from Constraints into Formal Grammars
نویسنده
چکیده
We present an approach specifying constraints on labeled trees, such as are commonly used within (computational) linguistic theories, and show how to translate these constraints to formal grammars, in particular context-free grammars and (lexicalized) tree adjoining grammars. Our method offers the formal advantages of constraint-based formalisms and at the same time operational efficiency for the analysis of formal grammars.
منابع مشابه
Linear plus fractional multiobjective programming problem with homogeneous constraints using fuzzy approach
We develop an algorithm for the solution of multiobjective linear plus fractional programming problem (MOL+FPP) when some of the constraints are homogeneous in nature. Using homogeneous constraints, first we construct a transformation matrix T which transforms the given problem into another MOL+FPP with fewer constraints. Then, a relationship between these two problems, ensuring that the solu...
متن کاملConstraints to Increasing Agricultural Production and Productivity among Women Farmers in Sub-Saharan Africa: Implications for Agricultural Transformation Agenda
Agriculture is an important engine of growth and poverty reduction in much of Africa, Nigeria inclusive. But the sector is underperforming in part because women, who are often crucial resource in agriculture and rural economy, face constraints that reduce their productivity. An understanding of these constraints is a prerequisite to devising policies to improve agricultural production and produ...
متن کاملParsing strategies with 'lexicalized' grammars: application to Tree Adjoining Grammars
In this paper, we present a parsing strategy that arose from the development of an Earley-type parsing algorithm for TAGs (Schabes and Joshi 1988) and from some recent linguistic work in TAGs (Abeillé: 1988a). In our approach, each elementary structure is systematically associated with a lexical head. These structures specify extended domains of locality (as compared to a context-free grammar) ...
متن کاملThe Relation Between Tree{Adjoining Grammars and Constraint Dependency Grammars
For the two grammar formalisms Tree{Adjoining Grammars (TAGs) and Constraint Dependency Grammars (CDGs), it is known that they are mildly context{sensitive. In both formalisms, natural{language phenomena can appropriately be speci ed. TAGs provide an adequate domain of locality by de ning trees as rules. In a CDG, more or less strictly formulated local constraints are written which must be sati...
متن کاملIntegration of Triple Graph Grammars and Constraints
Metamodels are often augmented with additional constraints that must be satisfied by valid instances of these metamodels. Such constraints express complex conditions that cannot be expressed in the metamodel itself. Model transformations have to take such constraints of the source and target metamodels into account. Given a valid source model, which satisfies the source constraints, a model tra...
متن کامل